Scheduling on Unrelated Machines under Tree-Like Precedence Constraints
نویسندگان
چکیده
منابع مشابه
Multi-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کاملA new formulation for scheduling unrelated processor under precedence constraints
— We give a new formulation for the problem oftask scheduling into unrelated processors under precedence constraints. This formulation has a polynomial number of variables and does not require that the processing times be integer valued.
متن کاملA New Formulation for Scheduling Unrelated Processors under Precedence Constraints
We give a new formulation for the problem of task scheduling into unrelated processors under precedence constraints. This formulation has a polynomial number of variables and does not require that the processing times be integer valued. 1 Motivation Let T = ft 1 ; : : :; t n g be a set of partially ordered tasks and P = fp 1 ; : : :; p m g a set of processors. We are also given an (acyclic dire...
متن کاملMulti-objective Unrelated Parallel Machines Scheduling with Sequence-dependent Setup times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کاملA comment on scheduling on uniform machines under chain-type precedence constraints
In a recent paper, Chekuri and Bender (Proceedings of IPCO’98, pp. 383–393) derive (among other results) a polynomial-time 6-approximation algorithm for makespan minimization on uniform parallel machines subject to chain-type precedence constraints. In this short note, we combine some straightforward observations and thereby derive an extremely simple 2-approximation algorithm for this problem....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2007
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-007-9004-y